About statistical-parallax algorithms
نویسنده
چکیده
The results obtained by two algorithms of statistical parallaxes applied to a large sample of RR Lyrae stars are compared. They show no significant difference and confirm the validity of the earlier approach based on the principle of maximum likelihood.
منابع مشابه
Systematics of RR Lyrae Statistical Parallax III: Apparent Magnitudes and Extinctions
We sing the praises of the central limit theorem. Having previously removed all other possible causes of significant systematic error in the statistical parallax determination of RR Lyrae absolute magnitudes, we investigate systematic errors from two final sources of input data: apparent magnitudes and extinctions. We find corrections due to each of about 0.05 mag, i.e., about half the statisti...
متن کاملDepth Perception in Driving: Alcohol Intoxication, Eye Movement Changes, and the Disruption of Motion Parallax
Motion parallax, the ability to recover depth from retinal motion, is a crucial part of the visual information needed for driving. Recent work indicates that the perception of depth from motion parallax relies on the slow eye movement system. It is well known that that alcohol intoxication reduces the gain of this slow eye movement system, the basis for the "horizontal gaze nystagmus" field sob...
متن کاملStellar Absolute Magnitudes via the Statistical Parallax Method
I review statistical parallax absolute magnitude determinations which employ data from the Hipparcos satellite for RR Lyrae and Cepheid variables, and for several other stellar classes. Five groups have studied the RR Lyrae stars, and the results are reassuringly consistent: MV (RR) = 0.77 ± 0.13 mag at [Fe/H] = –1.6 dex. Extensive Monte Carlo simulations showed that systematic errors are small...
متن کاملFast Parallel Image Matching Algorithm on Cluster
This paper introduces our experiences with developing fast Parallel stereo matching algorithm on Cluster. The key technique of generating DEMs or DSMs’ from remote-sensing images is stereo matching, and it’s one of the most time consuming algorithms, so that many efforts have been carried out to develop fast algorithms. Many difficulty problems continue to challenge researchers in this field; t...
متن کاملIterative Parallax Mapping with Slope Information
This paper improves per-pixel displacement mapping algorithms. First we review the previous work including bump, parallax, and relief mapping, and also sphere tracing. Then we propose a new iterative algorithm based on parallax mapping, which takes into account the surface slope represented by the stored normal vector. We show that the new method is much better than parallax mapping, however a ...
متن کامل